Extremal results on average subtree density of series-reduced trees
نویسندگان
چکیده
منابع مشابه
Extremal Distances for Subtree Transfer Operations in Binary Trees
Three standard subtree transfer operations for binary trees, used in particular for phylogenetic trees, are: tree bisection and reconnection (TBR), subtree prune and regraft (SPR) and rooted subtree prune and regraft (rSPR). For a pair of leaf-labelled binary trees with n leaves, the maximum number of such moves required to transform one into the other is n−Θ( √ n), extending a result of Ding, ...
متن کاملOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملExtremal values of ratios: distance problems vs. subtree problems in trees
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subtrees, for a number of extremal problems [Discrete Appl. Math. 155 (3) 2006, 374–385; Adv. Appl. Math. 34 (2005), 138–155]. Barefoot, Entringer and Székely [Discrete Appl. Math. 80(1997), 37–56] determined extremal values of σT (w)/σT (u), σT (w)/σT (v), σ(T )/σT (v), and σ(T )/σT (w), where T is ...
متن کاملExtremal values of ratios: Distance problems vs. subtree problems in trees II
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subtrees, for a number of extremal problems [Discrete Appl. Math. 155 (3) 2006, 374–385; Adv. Appl. Math. 34 (2005), 138–155]. Barefoot, Entringer and Székely [Discrete Appl. Math. 80(1997), 37–56] determined extremal values of σT (w)/σT (u), σT (w)/σT (v), σ(T )/σT (v), and σ(T )/σT (w), where T is ...
متن کاملThe Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2014
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.02.003